Easiness Assumptions and Hardness Tests : Trading Time for Zero
نویسنده
چکیده
We propose a new approach towards derandomization in the uniform setting, where it is computationally hard to nd possible mistakes in the simulation of a given probabilistic algorithm. The approach consists in combining both easiness and hardness complexity assumptions: if a derandomization method based on an easiness assumption fails, then we obtain a certain hardness test that can be used to remove error in BPP algorithms. As an application, we prove that every RP algorithm can be simulated by a zero-error probabilistic algorithm, running in expected subexponential time, that appears correct innnitely often (i.o.) to every eecient adversary. A similar result by Impagliazzo and Wigderson (FOCS'98) states that BPP allows de-terministic subexponential-time simulations that appear correct with respect to any eeciently sampleable distribution i.o., under the assumption that EXP 6 = BPP; in contrast, our result does not rely on any unproven assumptions. As another application of our techniques, we get the following gap theorem for ZPP: either every RP algorithm can be simulated by a deter-ministic subexponential-time algorithm that appears correct i.o. to every eecient adversary, or EXP = ZPP. In particular, this implies that if ZPP is somewhat easy, e.g., ZPP DTIME(2 n c) for some xed constant c, then RP is subexponentially easy in the uniform setting described above.
منابع مشابه
Easiness Assumptions and Hardness Tests: Trading Time for Zero Error
We propose a new approach towards derandomization in the uniform setting, where it is computationally hard to find possible mistakes in the simulation of a given probabilistic algorithm. The approach consists in combining both easiness and hardness complexity assumptions: if a derandomization method based on an easiness assumption fails, then we obtain a certain hardness test that can be used t...
متن کامل4-Round Concurrent Non-Malleable Commitments
The round complexity of non-malleable commitments and non-malleable zero knowledge arguments has been an open question for long time. Very recent results of Pass [TCC 2013] and of Goyal et al. [FOCS 2014, STOC 2016], gave almost definitive answers. In this work we show how to construct round-efficient non-malleable protocols via compilers. Starting from protocols enjoying limited non-malleabili...
متن کاملContinuous-time trading and the emergence of randomness
A new definition of events of game-theoretic probability zero in continuous time is proposed and used to prove results suggesting that trading in financial markets results in the emergence of properties usually associated with randomness. This paper concentrates on “qualitative” results, stated in terms of order (or order topology) rather than in terms of the precise values taken by a price pro...
متن کاملRanking the Trading Symbols of the Largest Companies Listed in the Tehran Stock Exchange Based on the Probability of Informed Trade Criteria
I n this paper, trading symbols of the 30 largest companies listed in the Tehran Stock Exchange (TSE) were ranked based on the asymmetry information risk. Using the Ersan and Alici (2016) modified clustering algorithm (EA), we estimated the probability of informed trading (PIN) to measure the asymmetry information among traders for each trading symbol and trading day through two-year...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2000